Lattice of subgroups

In mathematics, the lattice of subgroups of a group G is the lattice whose elements are the subgroups of G, with the partial order relation being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, and the meet of two subgroups is their intersection.

Lattice theoretic information about the lattice of subgroups can sometimes be used to infer information about the original group, an idea that goes back to the work of Øystein Ore (1937, 1938). For instance, as Ore proved, a group is locally cyclic if and only if its lattice of subgroups is distributive. Lattice-theoretic characterizations of this type also exist for solvable groups and perfect groups (Suzuki 1951).

Contents

Example

The dihedral group Dih4 has ten subgroups, counting itself and the trivial subgroup. Five of the eight group elements generate subgroups of order two, and two others generate the same cyclic group C4. In addition, there are two groups of the form C2×C2, generated by pairs of order-two elements. The lattice formed by these ten subgroups is shown in the illustration.

Characteristic lattices

Subgroups with certain properties form lattices, but other properties do not.

However, neither finite subgroups nor torsion subgroups form a lattice: for instance, the free product \mathbf{Z}/2\mathbf{Z} * \mathbf{Z}/2\mathbf{Z} is generated by two torsion elements, but is infinite and contains elements of infinite order.

See also

References

External links